Homoroot Integer Numbers
نویسنده
چکیده
In this paper we first define homorooty between two integer numbers and study some of their properties. Thereafter we state some applications of the homorooty in studying and solving some Diophantine equations and systems, as an interesting and useful elementary method. Also by the homorooty, we state and prove the necessary and sufficient conditions for existence of finite solutions in a special case of the quartic equation and evaluate the bounds of its solutions.
منابع مشابه
Developing a Mixed Integer Quadratic Programing Model with Integer Numbers for Designing a Dynamic closed-loop Logistics Network
Logistics Network Design includes network configuration decisions having long-standing influences on other tactical and operational decisions. Recently, regarding environmental issues and customer awareness and global warming closed-loop supply chain network design is taken into consideration. The proposed network for the integrated forward and reverse logistics is developed by formulating a cy...
متن کاملAN OPTIMIZATION METHOD TO DETERMINE THE LEAST COMMON MULTIPLY
This paper proposes an Integer Programming model to obtain the Least Common Multiply (LCM) for some integer numbers. The proposed method is illustrated by a numerical example.
متن کاملOn Powers Associated with Sierpiński Numbers, Riesel Numbers and Polignac’s Conjecture
We address conjectures of P. Erdős and conjectures of Y.-G. Chen concerning the numbers in the title. We obtain a variety of related results, including a new smallest positive integer that is simultaneously a Sierpiński number and a Riesel number and a proof that for every positive integer r, there is an integer k such that the numbers k, k2, k3, . . . , kr are simultaneously Sierpiński numbers.
متن کاملNovel Encryption Schemes Based on Catalan Numbers
Applied Number theory has so many applications in cryptography. Particularly integer sequences play very important in cryptography. Earlier cryptographic algorithms were designed using the integer sequences of Fibonacci numbers and Lucas numbers. In the present paper novel cryptographic algorithms were proposed basing on integer sequences of Catalan numbers.
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کامل